Rostering from Staffing Levels a Branch - and - Price Approach

نویسندگان

  • Egbert van der Veen
  • Bart Veltman
چکیده

Many rostering methods first create shifts from some given staffing levels, and after that create rosters from the set of created shifts. Although such a method has some nice properties, it also has some bad ones. In this paper we outline a method that creates rosters directly from staffing levels. We use a Branch-and-Price (B&P) method to solve this rostering problem and compare it to an ILP formulation of the subclass of rostering problems studied in this paper. The two methods perform almost equally well. Branch-and-Price, though, turns out to be a far more flexible approach to solve rostering problems. It is not too hard to extend the Branch-and-Price model with extra rostering constraints. However, for ILP this is much harder, if not impossible. Next to this, the Branch-and-Price method is more open to improvements and hence, combined with the larger flexibility, we consider it better suited to create rosters directly from staffing levels in practice.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of three mathematical models of the Staff Rostering Problem

Staff rostering is a major challenge in the service sector, where exploitation costs are essentially made up of staffing costs. Searching for an optimum has direct economic returns but the rosters must satisfy numerous legal constraints. This paper presents work on an exact approach using branch-and-price methods on a concrete situation. We develop three MILP models and extend them with valid i...

متن کامل

New approaches to nurse rostering benchmark instances

This paper presents the results of developing a branch and price algorithm and an ejection chain method for nurse rostering problems. The approach is general enough to be able to apply it to a wide range of benchmark nurse rostering instances. The majority of the instances are real world applications. They have been collected from a variety of sources including industrial collaborators, other r...

متن کامل

Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem

The efficient management of nursing personnel is of critical importance in a hospital’s environment comprising a vast share of the hospital’s operational costs. The nurse scheduling process affects highly the nurses’ working conditions, which are strongly related to the provided quality of care. In this paper, we consider the rostering over a mid-term period that involves the construction of du...

متن کامل

A Decision Support System for Crew Planning in Passenger Transportation Using a Flexible Branch-and-Price Algorithm

This paper discusses a decision support system for airline and railway crew planning. The system is a state-of-the-art branch-and-price solver that is used for crew scheduling and crew rostering. We briefly discuss the mathematical background of the solver, of which most part is covered in the Operations Research literature. Crew scheduling is crew planning for one or a few days that results in...

متن کامل

An Integer Programming-Based Nurse Rostering System

This paper considers a real-world rostering problem at the Gold Coast Hospital, Queensland. Nurse rostering is a constraint satisfaction problem (CSP) [3]. The task is to find a consistent allocation of shift values, for a group of nurses, over a fixed period of time, that satisfy a set of rostering constraints. These constraints include i) acceptable shift combinations (or schedules) for indiv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010